ENCRYPTION AND DECRYPTION OF AUDIO SIGNAL BASED ON RSA ALGORITHN
نویسندگان
چکیده
منابع مشابه
Generating RSA Encryption and Decryption Exponents
that is, d is e−1 (the inverse of e) in Zφ(n). We now turn to the question of how Alice chooses e and d to satisfy (1). One way she can do this is to choose a random integer e ∈ Zφ(n) and then solve (1) for d. We will show how to solve for d in Sections 46 and 47 below. However, there is another issue, namely, how does Alice find random e ∈ Zφ(n)? If Z ∗ φ(n) is large enough, then she can just ...
متن کاملQuaternion-based Encryption/Decryption of Audio Signal Using Digital Image as Variable Key
With the rapid growth of communication technology, cryptography plays a significant role in securing and verification of information exchanged via public communication channels. The current paper introduces a novel method for encrypting/decrypting audio signal using a selected digital image as a complicated key and cover for audio signal. Each sample of the audio signal is combined with the val...
متن کاملaudio signal encryption based on permutation relations and residue number system
this paper presents a new audio encryption algorithm based on permutation and residue number system. in the current approach, signal samples are combined with residue number system through permutation; therefore, a specific noise is generated. then, the audio signal is combined with the noise, generated by the algorithm, to produce a silence signal. for this purpose, the algorithm uses a predef...
متن کاملNew Computation Technique for Encryption and Decryption Based on Rsa and Elgamal Cryptosystems
Cryptography addresses the necessary elements for secure communication that involved privacy, confidentiality, key exchange, authentication, and non-repudiation. This paper proposed a new computation of encryption and decryption that was based on the computation of RSA and ElGamal Cryptosystems. The RSA is a public key encryption system that gets its security from the difficulty of factoring la...
متن کاملTrading decryption for speeding encryption in Rebalanced-RSA
In 1982, Quisquater and Couvreur proposed an RSA variant, called RSA-CRT, based on the Chinese Remainder Theorem to speed up RSA decryption. In 1990, Wiener suggested another RSA variant, called Rebalanced-RSA, which further speeds up RSA decryption by shifting decryption costs to encryption costs. However, this approach essentially maximizes the encryption time since the public exponent e is g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering Technologies and Management Research
سال: 2020
ISSN: 2454-1907
DOI: 10.29121/ijetmr.v5.i7.2018.259